Solution of some multi-dimensional lattice path parity difference recurrence relations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some recurrence relations for binary sequence matrices

This note compares and contrasts some properties of binary sequences with matrices and associated recurrence relations in order to stimulate some enrichment exercises and pattern puzzles.

متن کامل

Recurrence Relations and Two-Dimensional Set Partitions

In this paper, we consider a two-dimensional model for finite set partitions which arises in conjunction with a special case of a general non-linear recurrence. We investigate properties of some of the related counting sequences, including recurrences and generating functions. In particular, we obtain, by combinatorial arguments, some formulas relating these sequences to the Stirling numbers of...

متن کامل

Parity invariant lattice regularization of three - dimensional gauge - fermion system

In three dimensions, the effective action for the gauge field induced by integrating out a massless Dirac fermion is known to give either a parity-invariant or a parity-violating result, depending on the regularization scheme. We construct a lattice formulation of the massless Dirac fermion using the overlap formalism. We show that the result is parity invariant in contrast to the formulation u...

متن کامل

The Solution of Linear Probabilistic Recurrence Relations 1

Linear probabilistic divide-and-conquer recurrence relations arise when analyzing the running time of divide-and-conquer randomized algorithms. We consider first the problem of finding the expected value of the random process T (x), described as the output of a randomized recursive algorithm T . On input x , T generates a sample (h1, . . . , hk) from a given probability distribution on [0, 1]k ...

متن کامل

Multi-Dimensional Spectral Difference Method

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids has been developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1988

ISSN: 0012-365X

DOI: 10.1016/0012-365x(88)90029-5